metaSMT: Focus on Your Application not on Solver Integration

Decision procedures are used as core technique in many applications today. In this context, automated reasoning based on Satisfiability Modulo Theories (SMT) is very effective. However, developers have to decide which concrete engine to use and how to integrate the engine into the application. Even if file formats like SMTLIB standardize the input of many engines, advanced features remain unused and the integration of the engine is left to the programmer. This work presents metaSMT, a framework that integrates advanced reasoning engines into the program code of the respective application. metaSMT provides an easy to use language that allows engine independent programming while gaining from high performance reasoning engines. State-of-the-art solvers for satisfiability and other theories are available for the user via metaSMT with minimal programming effort. For two examples we show how metaSMT is used in current research projects.